Computer Based Test Using the Fisher-Yates Shuffle and Smith Waterman Algorithm
نویسندگان
چکیده
منابع مشابه
Novel Architecture for Data – Shuffling Using Fisher Yates Shuffle Algorithm
Securing information from obtrudes is the miscellaneous process in communication, cryptography is an effective manner of securing the information. New architecture is designed in this paper based on Fisher Yates Shuffle algorithm to maintain secrecy of data. A newly modified magic rectangle (NMMR) is constructed based few constrains, like sum of row and column values are equal. The numerical va...
متن کاملPlagiarism and Collusion Detection using the Smith-Waterman Algorithm
We investigate the use of variants of the Smith-Waterman algorithm to locate similarities in texts and in program source code, with a view to their application in the detection of plagiarism and collusion. The Smith-Waterman algorithm is a classical tool in the identification and quantification of local similarities in biological sequences, but we demonstrate that somewhat different issues aris...
متن کاملParallelizing the Smith-Waterman Local Alignment Algorithm using CUDA
Given two strings S1 = pqaxabcstrqrtp and S2 = xyaxbacsl, the substrings axabcs in S1 and axbacs in S2 are very similar. The problem of finding similar substrings is the local alignment problem. Local alignment is extensively used in computational biology to find regions of similarity in different biological sequences. Similar genetic sequences are identified by computing the local alignment of...
متن کاملPerformance Improvement of the Smith-Waterman Algorithm
Efficient sequence alignment is one of the most important and challenging activities in bioinformatics. Many algorithms have been proposed to perform and accelerate sequence alignment activities. Among them SmithWaterman (S-W) is the most sensitive (accurate) algorithm, however, the fact that it is the most computationally intensive algorithm makes it necessary to implement hardware acceleratio...
متن کاملA Smith-Waterman Algorithm Accelerator Based on Residue Number System
One of the biggest challenges confronting the bioinformatics community is fast and accurate sequence alignment. The Smith-Waterman algorithm (SWA) is one of the several algorithms used in addressing some of these challenges. Though very sensitive in doing sequence alignment, SWA is not used in real life applications due to the computational cost associated with the software implementation. Heur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KnE Social Sciences
سال: 2021
ISSN: 2518-668X
DOI: 10.18502/kss.v5i6.9224